The Strong Factorial Conjecture

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Strong Factorial Conjecture

In this paper, we present an unexpected link between the Factorial Conjecture ([8]) and Furter’s Rigidity Conjecture ([13]). The Factorial Conjecture in dimension m asserts that if a polynomial f in m variables Xi over C is such that L(f) = 0 for all k ≥ 1, then f = 0, where L is the C-linear map from C[X1, · · · , Xm] to C defined by L(X l1 1 · · ·X lm m ) = l1! · · · lm!. The Rigidity Conject...

متن کامل

On the irreducibility of a polynomial associated with the Strong Factorial Conjecture

The Strong Factorial Conjecture of E. Edo and A. van den Essen [3] is concerned with the linear functional L on the space of complex polynomials defined by sending a monomial generator z1 1 · · · zn n to (a1!) · · · (an!). The conjecture asserts that for a non-zero multi-variable complex polynomial F , the maximum number of consecutive zeroes that may appear in the sequence {L(F ) : n ≥ 1} is N...

متن کامل

The strong Nagata conjecture.

It is proved that there exist wild coordinates in the polynomial algebra in three variables over a field of characteristic zero. This result implies the famous Nagata conjecture.

متن کامل

The strong Anick conjecture.

Recently, Umirbaev proved the long-standing Anick conjecture, that is, there exist wild automorphisms of the free associative algebra Kx, y, z over a field K of characteristic 0. In particular, the well known Anick automorphism is wild. In this work, we obtain a stronger result (the Strong Anick Conjecture that implies the Anick Conjecture). Namely, we prove that there exist wild coordinates of...

متن کامل

The Strong Perfect Graph Conjecture

A graph is perfect if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line graphs of bipartite graphs and the complements of such graphs. These four classes of perfect graphs will be called basic. In 1960, Berge formulated two conjectures about perfect graphs, one stronger than the other. The weak...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2014

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2013.09.011